Topology Independent Multipath Routing for Data Center Networks
نویسندگان
چکیده
Data center communication networks are characterized by fast and intensive traffic changes, to the extent that a statistical approach routing has significant drawbacks. This paper proposes first solution takes into account every data flow. In order achieve required performance, proposed algorithm operates in plane, i.e. packet processing pipeline of programmable forwarding chips. Route updates triggered arrival new flows, immediately transferred upstream switches for them direct newly arriving flows along best path. enables handle such as large-scale flow incast patterns which historically presented challenges algorithms. With explicit knowledge current path state, can improve performance topologies used today. Additionally, being able operate with high arbitrary topology, enable introduction networks, instead designed goal supporting equal-cost multipath dominant modern centers.
منابع مشابه
Topology Switching for Data Center Networks
Emerging data-center network designs seek to provide physical topologies with high bandwidth, large bisection capacities, and many alternative data paths. Yet, existing protocols present a one-size-fits-all approach for forwarding packets. Traditionally, the routing process chooses one “best” route for each end-point pair. While some modern protocols support multiple paths through techniques li...
متن کاملAMP: A Better Multipath TCP for Data Center Networks
In recent years several multipath data transport mechanisms, such as MPTCP and XMP, have been introduced to effectively exploit the path diversity of data center networks (DCNs). However, these multipath schemes have not been widely deployed in DCNs. We argue that two key factors among others impeded their adoption: TCP incast and minimum window syndrome. First, these mechanisms are ill-suited ...
متن کاملMultipath Routing for Data Dissemination in Energy Efficient Sensor Networks
In wireless sensor networks (WSN) data produced by one or more sources usually has to be routed through several intermediate nodes to reach the destination. Problems arise when intermediate nodes fail to forward incoming messages. We increase the reliability of the system by providing a new routing mechanism that specifically takes into consideration possible failures on the communication paths...
متن کاملLink Independent and Node Independent Algorithms for Efficient Multipath Routing
Link-independent and node-independent DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. To achieve resilient multipath routing, first introduce the concept of independent directed acyclic graphs (IDAGs). For a given a network, we develop polynomialtime algorithms to compute li...
متن کاملRouting Techniques in Data Center Networks
Data Centers are the core of cloud computing as they consist of thousands of computers which are interconnected in a way to provide cloud services. A Data Center Network (DCNs) can be defined as centralized infrastructure providing several large scale computing and diversified network services like video streaming and cloud computing to its subscribed users [1]. With the proliferation of intern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3107236